A continuous family of partition statistics equidistributed with length

This article investigates a remarkable generalization of the generating function that enumerates partitions by area and number of parts. This generating function is given by the infinite product ∏ i≥1 1/(1 − tq ). We give uncountably many new combinatorial interpretations of this infinite product involving partition statistics that arose originally in the context of Hilbert schemes. We construct explicit bijections proving that all of these statistics are equidistributed with the length statistic on partitions of n. Our bijections employ various combinatorial constructions involving cylindrical lattice paths, Eulerian tours on directed multigraphs, and oriented trees.